Curvature of the Convex Hull of Planar Brownian Motion near Its Minimum Point
نویسندگان
چکیده
Let f be a (random) real-valued function whose graph represents the boundary of the convex hull of planar Brownian motion run until time 1 near its lowest point in a coordinate system so that f is non-negative and f(0) = 0. The ratio of f(x) and |x|/ | log |x|| oscillates near 0 between 0 and infinity a.s. 1. Main results. Let X = (X1, X2) be a 2-dimensional Brownian motion and let C denote the (closed) convex hull of X([0, 1]). It is well known that a.s. there exists a unique t0 ∈ (0, 1) such that X2 (t0) = min {X2(t) : t ∈ [0, 1]}. The boundary ∂ (C −X (t0)) of the translated convex hull C −X (t0) is a C-curve (Cranston et al. (1989)) so it is represented locally near 0 by the graph {(x, f(x)) : x ∈ R} of a random nonnegative C-function f : R → R, such that f(0) = 0. Our main result is contained in the following Theorem 1.1. (i) (1.1) lim sup x→0 f(x) |x| | log |x||−1 = ∞ a.s. (ii) (1.2) lim sup x→0 f(x) |x| | log |x||−1 log | log |x|| ≤ π a.s. For the sake of reference we state an obvious consequence of (1.2): for each ε > 0, (1.3) lim x→0 f(x) |x| | log |x||−1+ε = 0 a.s. The above statements give an idea about functions whose graphs stay locally (near 0) in C − X (t0). Cranston et al. (1989) investigated functions with graphs outside C − X (t0) in order to prove that ∂C is C-smooth. We will state one of their main results in a slightly changed form.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملDRAFT : Minimum Weight
Extended Abstract Summary: A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is convex and has four points from S on its boundary. A minimum weight convex quadrangulation with respect to S is a convex quadrangula...
متن کاملMinimum convex partition of a constrained point set
A convex partition with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is a convex polygon. A minimum convex partition with respect to S is a convex partition of S such that the number of convex polygons is minimised. In this paper, we wil...
متن کاملCombinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family of non-colliding motion planning problems for planar robot arms (open or closed polygonal chains). They induce canonical roadmaps in configuration spaces of simple planar polygons with
متن کاملEnhanced Way for Computing Smallest Convex Polygon and Euler Number
A convex hull is a polygon which encloses all given set of points.Euler number or Euler characteristic of an image has proven to be an important feature in many image analyses and visual inspection applications. This paper presents an algorithm for fast computing the convex hull of a planar scattered point set, which pre-strike an initial convex hull boundary, remove internal points in the boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005